/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e7 + 10;
int n, k;
char s[maxn];
int pre[maxn];
char ans[maxn];
int find(int x)
{
    if (x == pre[x])
        return x;
    return pre[x] = find(pre[x]);
}
int main()
{
    scanf("%d", &n);
    int maxx = 0;
    for (int i = 1; i <= 10000000; i++)
        pre[i] = i, ans[i] = 0;
    for (int i = 1; i <= n; i++)
    {
        scanf("%s%d", s + 1, &k); //k是坐标个数
        int len = strlen(s + 1);
        for (int j = 1; j <= k; j++)
        { //j是第几个坐标
            int p;
            scanf("%d", &p); //p是坐标号
            maxx = max(maxx, p + len - 1);
            for (int l = p; l <= p + len - 1; l = find(l + 1))
            {
                //l是ans字符串坐标
                int m = l - p + 1;
                ans[l] = s[m];
                pre[l] = l + 1;
            }
        }
    }
    for (int i = 1; i <= maxx; i++)
    {
        if (ans[i] == 0)
            putchar('a');
        else
            putchar(ans[i]);
    }
    getchar();
    getchar();
    return 0;
}
